This chapter argues that ethics plays an extremely important role in decision making and lawmaking in bioethics issues. These decisions are not simple case-by-case judgments; rather, they rest upon deeply considered ethical opinions. It also discusses the implications of this epistemic grounding for bioethics and its use of case law materials as an ethical resource. Finally, since many people base their moral judgments on religious beliefs, the religious implications of this legal-moral relationship are considered.

This paper is based on a semantic foundation of quantum logic which makes use of dialog-games. In the first part of the paper the dialogic method is introduced and under the conditions of quantum mechanical measurements the rules of a dialog-game about quantum mechanical propositions are established. In the second part of the paper the quantum mechanical dialog-game is replaced by a calculus of quantum logic. As the main part of the paper we show that the calculus of quantum logic (...) is complete and consistent with respect to the dialogic semantics. Since the dialoggame does not involve the 'excluded middle' the calculus represents a calculus of effective (intuitionistic) quantum logic. In a forthcoming paper it is shown that this calculus is equivalent to a calculus of sequents and more interestingly to a calculus of propositions. With the addition of the 'excluded middle' the latter calculus is a model for the lattice of subspaces of a Hilbert space. (shrink)

In a preceding paper [1] it was shown that quantum logic, given by the tableaux-calculus Teff, is complete and consistent with respect to the dialogic foundation of logics. Since in formal dialogs the special property of the 'value-definiteness' of propositions is not postulated, the calculus $T_{eff}$ represents a calculus of effective (intuitionistic) quantum logic. Beginning with the tableaux-calculus the equivalence of $T_{eff}$ to calculi which use more familiar figures such as sequents and implications can be investigated. In this paper we (...) present a sequents-calculus of Gentzen-type and a propositional calculus of Brouwer-type which are shown to be equivalent to $T_{eff}$ . The effective propositional calculus provides an interpretation for a lattice structure, called quasi-implicative lattice. If, in addition, the value-definiteness of quantum mechanical propositions is postulated, a propositional calculus is obtained which provides an interpretation for a quasi-modular orthocomplemented lattice which, as is well-known, has as a model the lattice of subspaces of a Hilbert space. (shrink)

Conservative ethical systems, particularly organized religions, are frequently at odds with the means, if not the goals of the new reproductive technologies. Among the most problematic measures adopted in recent years to allow childless women to raise genetically related offspring is surrogate motherhood. Traditional Jewish law, or Halakha, notwithstanding this reluctance, is, nevertheless, more likely than many others to find reasons to justify the practice, given its well-known stance viz procreation and its leniency regarding the new reproductive technologies. In the (...) following article, we ask whether Halakha, which allows abortion to save the life of a mother, would sanction the employment of a surrogacy arrangement in the case where pregnancy threats her life, in order to save the fetus as well. (shrink)

Upshot: A successful program for an enactive view of dreaming would have to clarify phenomenal and neurophysiological similarities and differences between waking perception, imagination, and dreaming. An embodied and skillful view of the dream process would require careful investigation of somatic sources of dream content, including sensory incorporation, and global, indirect ways in which dream content reacts metaphorically to changes in bodily states. Neurophenomenology of dreams would benefit from developing dreaming-specific approaches to training researchers and participants in phenomenological methods.

This paper calculates, in a precise way, the complexity of the index sets for three classes of computable structures: the class $K_{\omega _{1}^{\mathit{CK}}}$ of structures of Scott rank $\omega _{1}^{\mathit{CK}}$ , the class $K_{\omega _{1}^{\mathit{CK}}+1}$ of structures of Scott rank $\omega _{1}^{\mathit{CK}}+1$ , and the class K of all structures of non-computable Scott rank. We show that I(K) is m-complete $\Sigma _{1}^{1},\,I(K_{\omega _{1}^{\mathit{CK}}})$ is m-complete $\Pi _{2}^{0}$ relative to Kleen's O, and $I(K_{\omega _{1}^{\mathit{CK}}+1})$ is m-complete $\Sigma _{2}^{0}$ relative to O.